3-Anti-Circulant Digraphs Are <i>α</i>-Diperfect and BE-Diperfect
نویسندگان
چکیده
Let D be a digraph. A subset S of V (D) is stable set if every pair vertices in non-adjacent D. collection disjoint paths path partition D, vertex exactly one . We say that and are orthogonal each contains S. digraph satisfies the α-property for maximum there exists such orthogonal. α-diperfect induced subdigraph α-property. In 1982, Berge proposed characterization digraphs terms forbidden anti-directed odd cycles. 2018, Sambinelli, Silva Lee similar conjecture. Begin-End-property or BE-property 1) 2) P ∈ , either start end belongs to BE-diperfect BE-property. blocking this paper, we verified both conjectures 3-anti-circulant digraphs. also present some structural results
منابع مشابه
Cycles in 3-anti-circulant digraphs
A digraph D is a 3-anti-circulant digraph, if for any four distinct vertices x1, x2, x3, x4 ∈ V (D), x1 → x2 ← x3 → x4 implies x4 → x1. In this paper, we characterize the structure of 3-anti-circulant digraphs containing a cycle factor and show that the structure is very close to semicomplete and semicomplete bipartite digraphs. Laborde et al. conjectured that every digraph has an independent s...
متن کاملInfinite Circulant Digraphs and Random Infinite Circulant Digraphs
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.
متن کاملCirculant Digraphs and Monomial Ideals
It is known that there exists a Minimum Distance Diagram (MDD) for circulant digraphs of degree two (or double-loop computer networks) which is an L-shape. Its description provides the diameter and the average distance of the graph on constant time. In this paper we clarify, justify and extend these diagrams to circulant digraphs of arbitrary degree by presenting monomial ideals as a natural to...
متن کاملHamiltonian cycles in (2, 3, c)-circulant digraphs
Let D be the circulant digraph with n vertices and connection set {2, 3, c}. (Assume D is loopless and has outdegree 3.) Work of S.C. Locke and D.Witte implies that if n is a multiple of 6, c ∈ {(n/2) + 2, (n/2) + 3}, and c is even, then D does not have a hamiltonian cycle. For all other cases, we construct a hamiltonian cycle in D.
متن کاملkernels in circulant digraphs
a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open journal of Discrete Mathematics
سال: 2022
ISSN: ['2161-7635', '2161-7643']
DOI: https://doi.org/10.4236/ojdm.2022.123003